A fault-tolerant routing algorithm for wormhole routed meshes

نویسندگان

  • Pao Hwa Sui
  • Sheng-De Wang
چکیده

We investigate fault-tolerant routing schemes which aim at using low number of virtual channels in wormhole-routed mesh networks. The faults under consideration are rectangular block faults, which are suitable for modeling faults on board level in networks with grid structures. There is no restriction on the number of faults. The concepts of f-ring and f-chain are used in our scheme. Messages are routed minimally when not blocked by faults and are routed along the boundaries of the faults encountered. Only three virtual channels and local knowledge of faults are required for our routing scheme to be correct, deadlockand livelockfree. By allocating virtual channels to messages carefully, all virtual channels have the potential to be used by messages; hence, none of the virtual channels and its associated hardware is wasted. Ó 2000 Published by Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes

In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of th...

متن کامل

Adaptive Fault-tolerant Wormhole Routing in 2D Meshes

We present an adaptive fault-tolerant wormhole routing algorithm for 2D meshes. The main feature is that with the algorithm, a normal routing message, when blocked by some faulty processor, would detour along the f-polygons around the fault region. The proposed algorithm can tolerate convex faults with only three virtual channels per physical channel regardless of the overlapping of fpolygons o...

متن کامل

Adaptive fault-tolerant wormhole routing algorithms with low virtual channel requirements

We present simple methods to enhance a recently proposed class of fully adaptive algorithms for fault tolerant wormhole routing These algorithms are based on Duato s theory and are being used in several research projects We show that with three virtual channels per physical channel mulitple rectangular shaped fault blocks can be tolerated in two dimensional meshes There is no restriction on the...

متن کامل

A Euler-Path-Based Multicasting Model for Wormhole-Routed Networks: Its Applications to Damaged 2D Tori and Meshes

In this paper, we develop a new multicasting model for wormhole-routed networks based on the concept of Euler path in graph theory. The model can support multiple multicasts freely from deadlock and can be applied to any network which is Eulerian or is Eulerian after some links being removed. In particular, we demonstrate the power of this model by showing its fault-tolerant capability in suppo...

متن کامل

An Euler-Path-Based Multicasting Model for Wormhole-Routed Networks with Multi-Destination Capability

Recently, wormhole routers with multi-destination capability have been proposed to support fast multicast in a multi-computer network. In this paper, we develop a new multicasting model for such networks based on the concept of Euler path/circuit in graph theory. The model can support multiple concurrent multicasts freely from deadlock and can be applied to any network which is Eulerian or is E...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Parallel Computing

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2000